Non-Three-Colourable Common Graphs Exist
نویسندگان
چکیده
منابع مشابه
Non-Three-Colourable Common Graphs Exist
1School of Computer Science, McGill University, Montreal, Canada (e-mail: [email protected]) 2Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské náměstı́ 25, 118 00 Prague, Czech Republic and DIMAP, Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK (e-mail: [email protected]) 3Institute for Theoretical Computer ...
متن کاملNon-three-colorable Common Graphs Exist
A graph H is called common if the total number of copies of H in every graph and its complement asymptotically minimizes for random graphs. A former conjecture of Burr and Rosta, extending a conjecture of Erdős asserted that every graph is common. Thomason disproved both conjectures by showing that K4 is not common. It is now known that in fact the common graphs are very rare. Answering a quest...
متن کاملThree-colourable perfect graphs without even pairs
We still do not know how to construct the “most general” perfect graph, not even the most general three-colourable perfect graph. But constructing all perfect graphs with no even pairs seems easier, and here we make a start on it; we construct all three-connected three-colourable perfect graphs without even pairs and without clique cutsets. They are all either line graphs of bipartite graphs, o...
متن کاملA Note on Uniquely H-colourable Graphs
For a graph H, we compare two notions of uniquely H-colourable graphs, where one is defined via automorphisms, the second by vertex partitions. We prove that the two notions of uniquely H-colourable are not identical for all H, and we give a condition for when they are identical. The condition is related to the first homomorphism theorem from algebra.
متن کاملDiameter of 4-colourable graphs
We prove that for every connected 4-colourable graph G of order n and minimum degree δ ≥ 1, diam(G) ≤ 5n 2δ − 1. This is a first step toward proving a conjecture of Erdős, Pach, Pollack and Tuza [4] from 1989.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2012
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548312000107